Semantics of a Data-Parallel Logic Language using the BSP Execution Model

We present a parallel logic language which uses the bulk synchronous parallelism (BSP) execution model 13]. The BSP model provides a simple way to program parallel machines by restricting the SPMD style : processes are limited to a bounded asynchronism during local computations and communication is a global operation followed by a global synchronization. This in conjunction with explicit location provides a simple cost model that allow performance prediction. We adapt the data-parallel logic language DPlog 7] to t with theses characteristics and we present both a declarative and an operational semantics. The resulting language, we call BS-DPlog, ooers a great expressive power without any compromise to the advantages of BSP.